Universal Incremental Slepian-Wolf Coding
نویسنده
چکیده
We present a strategy for Slepian-Wolf coding when the joint distribution of the sources is unknown. The encoders use an incremental transmission policy, and the decoder a universal sequential decision test. We show that the decoder is able to decode shortly after the rates of transmission exceed the Slepian-Wolf bounds. The decoder then send an ACK back to the encoders, terminating transmission. As the timing of this ACK depends on the unknown statistics, the duration of the transmission is unknown in advance. Therefore, the scheme is variable-rate. It adapts its transmission rates to match the unknown joint entropy of the sources. We show how to apply these ideas in the rate distortion context of Wyner-Ziv coding. We specify an incremental universal coding strategy. We show that in the case of unknown, but jointly Gaussian statistics, there is no rate-loss in comparison with the case of fully known statistics.
منابع مشابه
Universal Coding for Lossless and Lossy Complementary Delivery Problems
This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary deliv...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Universal Decoding for Source–Channel Coding with Side Information
We consider a setting of Slepian–Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, ass...
متن کاملApproaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملOn the Reliability Function of Variable-Rate Slepian-Wolf Coding
The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepia...
متن کاملUniversal Linked Multiple Access Source Codes
We consider the multiple access source coding (MASC) problem (also known as the SlepianWolf problem) for situations where the joint source statistics are unknown a priori. Since neither encoder receives information about the joint source statistics, we allow an asymptotically negligible amount of communication between the encoders. We prove the existence of universal 2-encoder Linked MASCs (LMA...
متن کامل